A New Approach for Parallel Multigrid Adaption
نویسندگان
چکیده
We present a new approach for the parallel adaption of multigrids on distributed memory architectures. It is based on a simple, object-oriented data structure employing arrays rather than the more customary linked lists. The particular problem of dynamic load balancing is solved using an innovative recursive partitioning strategy. Large-scale computations on a Cray T3E system using up to 512 processors demonstrate the excellent efficiency and scalability of our approach. Moreover, the proposed partitioning strategy is shown to yield multigrids which are uniformly balanced over all grid levels.
منابع مشابه
Domain Decomposition vs
Domain Decomposition (DD) techniques are not only the basic tools for data partitioning but also methods for constructing new parallel pde solvers. Domain Decomposition, mesh adaption and load balance seem to be in contradiction to the eecient use of massively parallel computers with serveral hundered, or even several thousand powerful, distributed memory processors. In the case of plane bounda...
متن کاملSolving the Classic Radiosity Equation Using Multigrid Techniques
We investigate the application of multigrid techniques to the solution of the \classic" radiosity equation. After overviews of the global illumination problem and of radiosity, we describe the latter's solution via multigrid methods. An implementation of the multigrid algorithm presented here is able to solve the classic radiosity equation in about 50% of the time required by the more commonly-...
متن کاملA Parallel Wavelet-Based Algebraic Multigrid Black-Box Solver and Preconditioner
This work introduces a new parallel wavelet-based algorithm for algebraic multigrid method PWAMG using a variation of the standard parallel implementation of discrete wavelet transforms. This new approach eliminates the grid coarsening process in traditional algebraic multigrid setup phase simplifying its implementation on distributed memory machines. The PWAMG method is used as a parallel blac...
متن کاملThe Full Domain Partition Approach for Parallel Multigridon Adaptive
The combination of adaptive reenement, multigrid and parallel computing for solving partial diierential equations is considered. In the full domain partition each processor contains a partition of the grid plus the minimumnumber of additional coarse elements required to cover the whole domain. A parallel multigrid algorithm using the full domain partition is presented. The method obtains multig...
متن کاملA Parallel Multigrid Method Using the Full Domain Partition∗
The combination of adaptive refinement, multigrid and parallel computing for solving partial differential equations is considered. In the full domain partition approach, each processor contains a partition of the grid plus the minimum number of additional coarse elements required to cover the whole domain. A parallel multigrid algorithm using the full domain partition is presented. Multigrid ra...
متن کامل